Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness

نویسندگان

  • Klaus Ambos-Spies
  • Elvira Mayordomo
  • Yongge Wang
  • Xizhong Zheng
چکیده

We introduce balanced t(n)-genericity which is a reenement of the genericity concept of Ambos-Spies, Fleischhack and Huwig 2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity 6]. By uniformly describing these concepts and weaker notions of stochasticity introduced by Wilber 19] and Ko 11] in terms of prediction functions, we clarify the relations among these resource-bounded stochasticity concepts. Moreover, we give descriptions of these concepts in the framework of Lutz's resource-bounded measure theory 13] based on martingales: We show that t(n)-stochasticity coincides with a weak notion of t(n)-randomness based on so-called simple martingales but that it is strictly weaker than t(n)-randomness in the sense of Lutz.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource-Bounded Measure and Randomness

Supported by the Human Capital and Mobility Program of the European Community under grant CHRX-CT93-0415 (COLORET). Mathematisches Institut, Universit at Heidelberg, D-69120 Heidelberg, Germany Universidad de Zaragoza, Dept. Inform atica, CPS, Mar a del Luna 3, E-50015 Zaragoza, Spain We survey recent results on resource-bounded measure and randomness in structural complexity theory. In partic...

متن کامل

Genericity and Randomness over Feasible Probability Measures

This paper investigates the notion of resource bounded genericity developed by Ambos Spies Fleischhack and Huwig Ambos Spies Neis and Terwijn have recently shown that every language that is t n random over the uniform probability measure is t n generic It is shown here that in fact every language that is t n random over any strongly positive t n computable probability measure is t n generic Rou...

متن کامل

Lowness for Weak Genericity and Randomness

We prove that lowness for weak genericity is equivalent to semicomputable traceability which is strictly between hyperimmune-freeness and computable traceability. We also show that semi-computable traceability implies lowness for weak randomness. These results refute a conjecture raised by several people.

متن کامل

Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets

We show that the question of whether the p-tt-complete or p-T -complete sets for the deterministic time classes E and EXP have measure 0 in these classes in the sense of Lutz's resource-bounded measure cannot be decided by relativizable techniques. On the other hand, we obtain the following absolute results if we bound the norm, i.e., the number of oracle queries of the reductions: For r = tt; ...

متن کامل

Resource Bounded Randomness and Weakly Complete Problems 1

We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ((7, 8]). We concentrate on n c-randomness (c 2) which corresponds to the polynomial time bounded (p-) measure of Lutz, and which is adequate for studying the internal and quantitative structure of E = DTIME(2 lin). However we will also comment on E2 = DTIME(2 pol) and its corresponding (p2-)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996